Conflicting Literals and Defeasible Logic
نویسنده
چکیده
We shall say that C is a set of conflicting literals if and only if we do not want every element of C to be provable. Defeasible Logic is generalised to incorporate sets of conflicting literals. The resulting logic is more expressive and yields better solutions to some reasoning puzzles. Some properties of this generalised Defeasible Logic are proved.
منابع مشابه
DR-DEVICE: A Defeasible Logic RDF Rule Language
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. In this demonstration we present a prototype system for defeasible rea...
متن کاملRelating Defeasible Logic to the Well-Founded Semantics for Normal Logic Programs
The most recent version of defeasible logic (Nute 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs. A correspondence is shown between the assertions of a defeasible theory and the literals contained in the well-founded model of the translation. The translation scheme is based upon (Antoniou & Maher 2002) but is modified to account for ...
متن کاملA Defeasible Logic for Clauses
A new non-monotonic logic called clausal defeasible logic (CDL) is defined and explained. CDL is the latest in the family of defeasible logics, which, it is argued, is important for knowledge representation and reasoning. CDL increases the expressive power of defeasible logic by allowing clauses where previous defeasible logics only allowed literals. This greater expressiveness allows the repre...
متن کاملArgument Theory Change Applied to Defeasible Logic Programming
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation systems. This approach is based on Defeasible Logic Programming as the argumentation formalism from which we ground the definitions. The objective of our proposal is to define an argument revision operator that inserts a new argument into a defeasible logic program in such a w...
متن کاملRelating defeasible and normal logic programming through transformation properties
This paper relates the Defeasible Logic Programming (DeLP ) framework and its semantics SEMDeLP to classical logic programming frameworks. In DeLP we distinguish between two different sorts of rules: strict and defeasible rules. Negative literals ( A) in these rules are considered to represent classical negation. In contrast to this, in normal logic programming (NLP ), there is only one kind of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007